Method for determining information which enable a mobile station to identify which resources are allocated to the mobile station

ABSTRACT

A method determining information enabling a mobile station to identify which wireless telecommunication network resources are allocated to the mobile station. The allocated resources are divided into plural non contiguous clusters of resources. The method includes: allocating resources to the mobile station; determining, from the allocated resources, plural ordered parameters each equal to a number of contiguous resources allocated or not to the mobile station; calculating, for a first parameter, a number of possibilities having a subset of resources including an amount of resources that is lower than the first parameter; calculating, for each following parameter, a number of possibilities having subsets of resources including amounts of resources respectively equal to the respective parameters having a lower rank than the following parameter and having a subset of at least one resource including an amount of resources lower than the following parameter; determining information by summing the calculated numbers.

The present invention relates generally to a method and a device fordetermining information which enable a mobile station to identify whichresources of a wireless telecommunication network are allocated to themobile station.

More precisely, the present invention is in the field of the signallingof resources allocated to a mobile station in a wirelesstelecommunication network.

Orthogonal Frequency-Division Multiplexing (OFDM) is based upon theprinciple of frequency-division multiplexing (FDM) and is implemented asa digital modulation scheme. The bit stream to be transmitted is splitinto several parallel bit streams, typically dozens to thousands. Theavailable frequency spectrum is divided into several sub-channels, andeach low-rate bit stream is transmitted over one sub-channel bymodulating a sub-carrier using a standard modulation scheme, for examplePSK, QAM, etc. The sub-carrier frequencies are chosen so that themodulated data streams are orthogonal to each other, meaning that crosstalk between the sub-channels is eliminated.

The primary advantage of OFDM is its ability to cope with severe channelconditions, for example, multipath and narrowband interference, withoutcomplex equalization filters. Channel equalization is simplified byusing many slowly modulated narrowband signals instead of one rapidlymodulated wideband signal.

A variation called DFT spread OFDM or SC-FDMA (Single CarrierFrequency-Division Multiple Access) has been developed. In this system,each symbol to be transmitted is spread over a set of transmittedfrequencies by a DFT (Discrete Fourier Transform), the resulting signalis sent over a conventional OFDMA transmission system.

Actual implementation of coding/decoding is made either in the frequencydomain or in the time domain while the implementation in the frequencydomain may be preferred.

Sometimes, the used subcarriers cannot be allocated in a contiguoussub-band, but need to be separated into several clusters. This leads toClustered SC-FDMA, which has the advantage of a more flexible subcarriermapping with respect to localized SC-FDMA, leading to more schedulinggain and better multi-user multiplexing.

The present invention aims at providing a telecommunication systemwherein all the sub-carriers allocated to a telecommunication device aredivided into at least two non contiguous clusters and wherein thesignalling of the allocated sub-carriers is reduced.

To that end, the present invention concerns a method for determininginformation which enable a mobile station to identify among a set ofresources that can be allocated in a wireless telecommunication networkto the mobile station, which resources of the wireless telecommunicationnetwork are allocated to the mobile station, the allocated resourcesbeing divided into plural non contiguous clusters of one resource or ofplural contiguous resources, characterised in that the method comprisesthe steps of:

-   -   allocating resources to the mobile station, the allocated        resources dividing the set of resources into subsets of        resources,    -   determining, from the allocated resources, plural ordered        parameters, each parameter being equal to a number of contiguous        resources in a subset of at least one resource corresponding to        the parameter, the at least one resource being not allocated to        the mobile station or forming a cluster of one resource or of        plural contiguous resources allocated to the mobile station,    -   calculating, for the first parameter, within the set of possible        resource allocations, the number of possibilities of having in        the corresponding subset, an amount of resources that is lower        than the first parameter,    -   calculating, for each following parameter, within the set of        possible resource allocations, the number of possibilities of        having for each subset corresponding to a parameter having a        lower rank than said following parameter an amount of resources        that is equal to the parameter the subset corresponds to and        having in the subset corresponding to said following parameter        an amount of resources that is lower than said following        parameter,    -   determining information which enable a mobile station to        identify which resources of the wireless telecommunication        network are allocated to the mobile station by summing all the        calculated numbers.

The present invention concerns also a device for determining informationwhich enable a mobile station to identify among a set of resources thatcan be allocated in a wireless telecommunication network to the mobilestation, which resources of the wireless telecommunication network areallocated to the mobile station, the allocated resources being dividedinto plural non contiguous clusters of one resource or of pluralcontiguous resources, characterised in that the device for determininginformation comprises:

-   -   means for allocating resources to the mobile station, the        allocated resources dividing the set of resources into subsets        of resources,    -   means for determining, from the allocated resources, plural        ordered parameters, each parameter being equal to a number of        contiguous resources in a subset of at least one resource        corresponding to the parameter, the at least one resource being        not allocated to the mobile station or forming a cluster of one        resource or of plural contiguous resources allocated to the        mobile station,    -   means for calculating, for the first parameter, within the set        of possible resource allocations, the number of possibilities of        having in the corresponding subset, an amount of resources that        is lower than the first parameter,    -   means for calculating, for each following parameter, within the        set of possible resource allocations, the number of        possibilities of having for each subset corresponding to a        parameter having a lower rank than said following parameter an        amount of resources that is equal to the parameter the subset        corresponds to and having in the subset corresponding to said        following parameter an amount of resources that is lower than        said following parameter,    -   means for determining information which enable a mobile station        to identify which resources of the wireless telecommunication        network are allocated to the mobile station by summing all the        calculated numbers.

Thus, it is possible to allocate non contiguous resources of thewireless telecommunication network to a mobile station with a reducedsignalling of the allocated resources.

According to a particular feature, at least two non-contiguous clustersof one resource or of plural contiguous resources are allocated to themobile station, each cluster of one resource or of plural contiguousresources comprising a number of resources which is independent of thenumber of resources comprised in other allocated cluster or clusters ofone resource or of plural contiguous resources, and the number ofresources separating two clusters of one resource or of pluralcontiguous resources is independent of any other resources that mayeither separate two clusters of one resource or of plural contiguousresources, or be comprised in other allocated clusters of one resourceor of plural contiguous resources.

Thus, a maximum of flexibility is ensured.

According to a particular feature, at least three non-contiguousclusters of one resource or of plural contiguous resources are allocatedto the mobile station, each cluster of one resource or of pluralcontiguous resources comprising the same number of resources which isindependent of any other resources that may separate two clusters.

Thus, signaling overhead is reduced.

According to a particular feature, the first parameter is the number ofresources comprised in each cluster of one resource or of pluralcontiguous resources.

According to a particular feature, at least three non-contiguousclusters of one resource or of plural contiguous resources are allocatedto the mobile station, each cluster of one resource or of pluralcontiguous resources comprising a number of resources which isindependent of the number of resources comprised in other allocatedclusters of one resource or of plural contiguous resources and thenumbers of resources separating two clusters are identical.

Thus, signaling overhead is reduced.

According to a particular feature, the first parameter is the number ofresources separating two clusters of one resource or of pluralcontiguous resources.

Thus, the complexity to implement the present invention is reduced.

According to a particular feature, the number of clusters of oneresource or of plural contiguous resource is predetermined.

Thus, the signalling overhead is reduced.

According to a particular feature, the base station:

-   -   computes the number of all possible resource allocations with at        least a predetermined number of clusters and less than the        current number of clusters,    -   modifies the information which enables the mobile station to        identify which resources of the wireless telecommunication        network are allocated to the mobile station by adding the number        of all possible resource allocations with at least a        predetermined number of clusters and less than the current        number of clusters to the information.

Thus, the mobile station is able to determine the number of clustersthat were allocated to it without prior knowledge on this number ofclusters.

According to still another aspect, the present invention concerns amethod for identifying among a set of resources that can be allocated ina wireless telecommunication network to a mobile station, whichresources of the wireless telecommunication network are allocated to themobile station, the allocated resources being divided into plural noncontiguous clusters of one resource or of plural contiguous resources,characterised in that the method comprises the steps executed by themobile station of:

-   -   receiving information which enable the mobile station to        identify which resources of the wireless telecommunication        network are allocated to the mobile station,    -   determining a number of possibilities of having a subset of at        least one resource corresponding to a first parameter, the        subset comprising less than a first amount of resources,    -   determining a number of possibilities of having a subset of at        least one resource corresponding to the first parameter, the        subset comprising less than the first amount of resources plus        one,    -   selecting the first amount of resources as a first parameter if        the number of possibilities of having a subset of at least one        resource corresponding to the first parameter, the subset        comprising less than the first amount of resources, is lower        than or equal to the received information and if the number of        possibilities of having a subset corresponding to the first        parameter, the subset of at least one resource comprising less        than the first amount of resources plus one, is upper than the        received information,    -   modifying the information which enables the mobile station to        identify which resources of the wireless telecommunication        network are allocated to the mobile station by subtracting the        number of possibilities of having a subset of at least one        resource corresponding to the first parameter, the subset        comprising an amount of resources inferior to the first        parameter, from the information which enables the mobile station        to identify which resources of the wireless telecommunication        network are allocated to the mobile station,

and as far as all the parameters are not determined,

-   -   determining for the following parameter, within the set of        possible resource allocations:        -   a first number of possibilities of having for each subset of            at least one resource corresponding to a parameter having a            lower rank than said following parameter, each subset            comprising an amount of resources that is equal to the            parameter the subset corresponds to and having a subset of            at least one resource corresponding to said following            parameter comprising an amount of resources that is lower            than a given value,        -   a second number of possibilities of having for each subset            of at least one resource corresponding to a parameter having            a lower rank than said following parameter, each subset            comprising an amount of resources that is equal to the            parameter the subset corresponds to and having a subset of            at least one resource corresponding to said following            parameter comprising an amount of resources that is lower            than a given value plus one,        -   selecting the given value as following parameter if the            first number is lower than or equal to the modified            information and if the second number is upper than the            modified information,    -   updating the modified information by subtracting the first        number from the modified information,    -   identifying among the set of resources that can be allocated in        the wireless telecommunication network to the mobile station,        which resources of the wireless telecommunication network are        allocated to the mobile station according to the parameters when        all the parameters are determined.

The present invention concerns also a device for identifying among a setof resources that can be allocated in a wireless telecommunicationnetwork to a mobile station, which resources of the wirelesstelecommunication network are allocated to the mobile station, theallocated resources being divided into plural non contiguous clusters ofone resource or of plural contiguous resources, characterised in thatthe device for identifying is included in the mobile station andcomprises:

-   -   means for receiving information which enable the mobile station        to identify which resources of the wireless telecommunication        network are allocated to the mobile station,    -   means for determining a number of possibilities of having a        subset of at least one resource corresponding to a first        parameter, the subset comprising less than a first amount of        resources,    -   means for determining a number of possibilities of having a        subset of at least one resource corresponding to the first        parameter, the subset comprising less than the first amount of        resources plus one,    -   means for selecting the first amount of resources as a first        parameter if the number of possibilities of having a subset of        at least one resource corresponding to the first parameter, the        subset comprising less than the first amount of resources, is        lower than or equal to the received information and if the        number of possibilities of having a subset corresponding to the        first parameter, the subset of at least one resource comprising        less than the first amount of resources plus one, is upper than        the received information,    -   means for modifying the information which enables the mobile        station to identify which resources of the wireless        telecommunication network are allocated to the mobile station by        subtracting the number of possibilities of having a subset of at        least one resource corresponding to the first parameter, the        corresponding subset comprising an amount of resources inferior        to the first parameter from the information which enables the        mobile station to identify which resources of the wireless        telecommunication network are allocated to the mobile station,    -   means for determining for the following parameter, within the        set of possible resource allocations and as far as all the        parameters are not determined:        -   a first number of possibilities of having for each subset of            at least one resource corresponding to a parameter having a            lower rank than said following parameter, each subset            comprising an amount of resources that is equal to the            parameter the subset corresponds to and having a subset of            at least one resource corresponding to said following            parameter comprising an amount of resources that is lower            than a given value,        -   a second number of possibilities of having for each subset            of at least one resource corresponding to a parameter having            a lower rank than said following parameter, each subset            comprising an amount of resources that is equal to the            parameter the subset corresponds to and having a subset of            at least one resource corresponding to said following            parameter comprising an amount of resources that is lower            than a given value plus one,        -   means for selecting for the following parameter the given            value as following parameter if the first number is lower            than or equal to the modified information and if the second            number is upper than the modified information, as far as all            the parameters are not determined,    -   means for updating the modified information by subtracting the        first number from the modified information as far as all the        parameters are not determined,    -   means for identifying among the set of resources that can be        allocated in the wireless telecommunication network to the        mobile station, which resources of the wireless        telecommunication network are allocated to the mobile station        according to the parameters when all the parameters are        determined.

Thus, it is possible to allocate non contiguous resources of thewireless telecommunication network to a mobile station with a limitedsignalling of the allocated resources.

According to a particular feature, the number of allocated clusters isdetermined by the mobile station by:

-   -   determining the number of resource allocations with at least a        minimum predetermined number of clusters and less than a given        number of clusters,    -   determining the number of resource allocations with at least the        minimum predetermined number of clusters and less than the given        number plus one of clusters,    -   selecting the given number as the number of clusters if the        number of resource allocations with at least the predetermined        minimum number of clusters and less than the given number of        clusters is lower than or equal to the received information and        if the number of resource allocations with at least the minimum        predetermined number of clusters and less than the given number        plus one of clusters is upper than the received information,    -   modifying the received information by subtracting the value of        number of resource allocations with at least the predetermined        minimum number of clusters and less than the given number of        clusters from the received information.

According to still another aspect, the present invention concernscomputer programs which can be directly loadable into a programmabledevice, comprising instructions or portions of code for implementing thesteps of the methods according to the invention, when said computerprograms are executed on a programmable device.

Since the features and advantages relating to the computer programs arethe same as those set out above related to the method and apparatusaccording to the invention, they will not be repeated here.

The characteristics of the invention will emerge more clearly from areading of the following description of an example embodiment, the saiddescription being produced with reference to the accompanying drawings,among which:

FIG. 1 represents a wireless cellular telecommunication network in whichthe present invention is implemented;

FIG. 2 is a diagram representing the architecture of a base station inwhich the present invention is implemented;

FIG. 3 is a diagram representing the architecture of a mobile station inwhich the present invention is implemented;

FIG. 4 illustrates the architecture of the encoder comprised in a mobilestation according to a particular embodiment of the invention infrequency domain;

FIG. 5 illustrates the architecture of the decoder of a base stationhaving one or several receive antennas according to a particularembodiment of the invention;

FIG. 6 represents a first example of three clusters of at least onegroup of resource blocks allocated to a mobile station and parametersaccording to the present invention;

FIG. 7 discloses a first example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a first mode of realisation of the presentinvention;

FIG. 8 discloses a second example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a second mode of realisation of thepresent invention;

FIG. 9 discloses a third example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a third mode of realisation of the presentinvention;

FIG. 10 represents a second example of three clusters of at least onegroup of resource blocks allocated to a mobile station and parametersaccording to the present invention;

FIG. 11 discloses a fourth example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a fourth mode of realisation of thepresent invention;

FIG. 12 represents a third example of three clusters of at least onegroup of resource blocks allocated to a mobile station and parametersaccording to the present invention;

FIG. 13 discloses a first example of an algorithm executed by a mobilestation according to the first mode of realisation of the presentinvention;

FIG. 14 discloses a second example of an algorithm executed by a mobilestation according to the second mode of realisation of the presentinvention;

FIG. 15 discloses a third example of an algorithm executed by a mobilestation according to the third mode of realisation of the presentinvention;

FIG. 16 discloses a fourth example of an algorithm executed by a mobilestation according to the fourth mode of realisation of the presentinvention;

FIG. 1 represents a wireless cellular telecommunication network in whichthe present invention is implemented.

The present invention will be described in an example wherein thetelecommunication system is a wireless cellular telecommunicationsystem.

The present invention is also applicable to wireless or wiredtelecommunication systems like Local Area Networks.

In that case, the base station and mobile station are emitters and/orreceivers.

In FIG. 1, one base station BS of the wireless cellulartelecommunication network and a mobile station MS are shown.

The present invention is described when the resources of the wirelesscellular telecommunication network to be used by the mobile station MSare allocated by a base station BS.

The resources of the wireless cellular telecommunication network are thefrequency spectrum and/or time slots used by the wireless cellulartelecommunication network. The frequency spectrum is, for example,decomposed into groups of resource blocks and each resource blockcomprises a predetermined number of sub-carriers, for example twelve.

It has to be noted here that in a variant a resource block may becomposed of a single sub-carrier.

The present invention will be disclosed with groups of resource blocks.The present invention is also applicable to resource blocks orresources.

The base station BS is a base station of a wireless cellulartelecommunication network comprising one or plural base stations.

Only one mobile station MS is shown for the sake of clarity but thewireless cellular telecommunication network may have a more importantnumber of mobile stations MS to communicate with the base station BS.

The base station BS may be named a node or an access point.

The mobile station MS may be a personal computer, a peripheral devicelike a set top box, or a phone.

According to the invention, at least two non contiguous clusters of atleast one group of resource blocks are allocated to one mobile stationMS.

According to the invention, in order to indicate the n allocatedclusters of at least one group of resource blocks, at least four and atmost 2n parameters are needed.

If some supplementary constraints are imposed, like a common size foreach cluster of one or plural contiguous groups of resource blocks orlike a common spacing between clusters of at least one group of resourceblocks, less than 2n independent parameters following a weighted sumconstraint are needed as it will be disclosed herein after.

Let us denote by Q the number of parameters independent under weightedsum constraint that are necessary to indicate an allocation with nnon-contiguous clusters. Let the Q parameters be noted M₀ . . . M₀ . . .M_(Q-1).

The condition of independence under weighted sum constraint of Qparameters representative of n non-contiguous clusters allocation can bewritten as:

$\quad\left\{ \begin{matrix}{{\sum\limits_{k = 0}^{Q - 1}\; {q_{k}M_{k}}} \leq {N_{RBG} + 1}} \\{{\sum\limits_{k = 0}^{Q - 1}\; q_{k}} = {2n}}\end{matrix} \right.$

where q_(k) is a coefficient which is representative of the number ofoccurrences of the parameter M_(k) in the allocation. Coefficients q_(k)are integer and strictly positive.

For example, q_(k) may be the number of clusters of one or pluralcontiguous groups of resource blocks if the number of groups of resourceblocks is identical for each cluster of one or plural contiguous groupsof resource blocks and M_(k) is the number of groups of resource blockscomprised in each cluster.

For example, q_(k) is the number of clusters minus one if the clustersof one or plural contiguous groups of resource blocks are equally spacedand M_(k) is the number of at least one group of resource blocks betweentwo clusters of at least one group of resource blocks.

For Q parameters (M₀ . . . M_(Q-1)) representative of an allocation withn clusters, the parameter M₀ can take values from one to:

${\left( {N_{RBG} + 1 - {\sum\limits_{p = 1}^{Q - 1}\; q_{p}}} \right)/q_{0}} = {N_{RBG} + 1 - {2n} + {q_{0}/{q_{0}.}}}$

Generally, for all k=0 . . . Q−1 we can state that:

For any fixed (M₀ . . . M_(k−1)), parameter M_(k) can take values from 1to:

${\left( {N_{RBG} + 1 - {\sum\limits_{p = 0}^{k - 1}\; {q_{p}M_{p}}} - {\sum\limits_{p = {k + 1}}^{Q - 1}\; q_{p}}} \right)/q_{k}} = {\left( {N_{RBG} + 1 - {2n} + q_{k} - {\sum\limits_{p = 0}^{k - 1}\; {q_{p}\left( {M_{p} - 1} \right)}}} \right)/q_{k}}$

According to the invention, the base station BS which handles the mobilestation MS or any core network device of the wireless cellulartelecommunication network:

-   -   allocates groups of resources blocks to the mobile station, the        allocated groups of resources blocks dividing the set of        resources into subsets of groups of resources blocks,    -   determines, from the allocated groups of resources blocks,        plural ordered parameters, each parameter being equal to a        number of contiguous groups of resources blocks in a subset of        at least one group of resources blocks corresponding to the        parameter, the at least one group of resources blocks being not        allocated to the mobile station or forming a cluster of one        group of resources blocks or of plural contiguous groups of        resources blocks allocated to the mobile station,    -   calculates, for the first parameter, within the set of possible        groups of resources blocks allocations, the number of        possibilities of having in the corresponding subset, an amount        of groups of resources blocks that is lower than the first        parameter,    -   calculates, for each following parameter, within the set of        possible groups of resources blocks allocations, the number of        possibilities of having for each subset corresponding to a        parameter having a lower rank than said following parameter, an        amount of groups of resources blocks that is equal to the        parameter the subset corresponds to and having in the subset        corresponding to said following parameter an amount of groups of        resources blocks that is lower than said following parameter,    -   determines information which enable a mobile station to identify        which groups of resources blocks of the wireless        telecommunication network are allocated to the mobile station by        summing all the calculated numbers.

The mobile station:

-   -   receives information which enable the mobile station to identify        which groups of resources blocks of the wireless        telecommunication network are allocated to the mobile station,    -   determines a number of possibilities of having a subset of at        least one group of resources blocks corresponding to a first        parameter, the subset comprising less than a first amount of        groups of resources blocks,    -   determines a number of possibilities of having a subset of at        least one group of resources blocks corresponding to the first        parameter, the subset comprising less than the first amount of        groups of resources blocks plus one,    -   selects the first amount of groups of resources blocks as a        first parameter if the number of possibilities of having a        subset of at least one group of resources blocks corresponding        to the first parameter, the subset comprising less than the        first amount of groups of resources blocks, is lower than or        equal to the received information and if the number of        possibilities of having a subset corresponding to the first        parameter, the subset of at least one group of resources blocks        comprising less than the first amount of groups of resources        blocks plus one, is upper than the received information,    -   modifies the information which enables the mobile station to        identify which groups of resources blocks of the wireless        telecommunication network are allocated to the mobile station by        subtracting the number of possibilities of having a subset of at        least one group of resources blocks corresponding to the first        parameter, the subset comprising an amount of groups of resource        blocks inferior to the first parameter, from the information        which enables the mobile station to identify which groups of        resources blocks of the wireless telecommunication network are        allocated to the mobile station,

and as far as all the parameters are not determined,

-   -   determines for the following parameter, within the set of        possible groups of resources blocks allocations:        -   a first number of possibilities of having for each subset of            at least one group of resources blocks corresponding to a            parameter having a lower rank than said following parameter,            each subset comprising an amount of groups of resources            blocks that is equal to the parameter the subset corresponds            to and having a subset of at least one group of resources            blocks corresponding to said following parameter comprising            an amount of groups of resources blocks that is lower than a            given value,        -   a second number of possibilities of having for each subset            of at least one group of resources blocks corresponding to a            parameter having a lower rank than said following parameter,            each subset comprising an amount of groups of resources            blocks that is equal to the parameter the subset corresponds            to and having a subset of at least one group of resources            blocks corresponding to said following parameter comprising            an amount of groups of resources blocks that is lower than a            given value plus one,        -   selects the given value as following parameter if the first            number is lower than or equal to the modified information            and if the second number is upper than the modified            information,    -   updates the modified information by subtracting the first number        from the modified information,    -   identifies among the set of groups of resources blocks that can        be allocated in the wireless telecommunication network to the        mobile station, which groups of resources blocks of the wireless        telecommunication network are allocated to the mobile station        according to the parameters when all the parameters are        determined.

FIG. 2 is a diagram representing the architecture of a base station inwhich the present invention is implemented.

The base station BS has, for example, an architecture based oncomponents connected together by a bus 201 and a processor 200controlled by the programs as disclosed in FIGS. 7, 8, 9 and 11.

It has to be noted here that the base station BS may have anarchitecture based on dedicated integrated circuits.

The bus 201 links the processor 200 to a read only memory ROM 202, arandom access memory RAM 203, a wireless interface 205 and a networkinterface 206.

The memory 203 contains registers intended to receive variables and theinstructions of the program related to the algorithms as disclosed inFIGS. 7, 8, 9 and 11.

The processor 200 controls the operation of the network interface 206and of the wireless interface 205.

The read only memory 202 contains instructions of the program related tothe algorithms as disclosed in FIGS. 7, 8, 9 and 11, which aretransferred, when the base station BS is powered on, to the randomaccess memory 203.

The base station BS may be connected to a telecommunication networkthrough the network interface 206. For example, the network interface206 is a DSL (Digital Subscriber Line) modem, or an ISDN (IntegratedServices Digital Network) interface, etc.

The wireless interface 205 comprises means for transferring informationrepresentative of the sub-carriers allocated to the mobile station MS.

The wireless interface 205 comprises a decoder as disclosed in FIG. 5.The wireless interface 205 may comprise an encoder as disclosed in FIG.4.

FIG. 3 is a diagram representing the architecture of a mobile station inwhich the present invention is implemented.

The mobile station MS has, for example, an architecture based oncomponents connected together by a bus 301 and a processor 300controlled by the programs as disclosed in FIGS. 13, 14, 15 and 16.

It has to be noted here that the mobile station MS may have anarchitecture based on dedicated integrated circuits.

The bus 301 links the processor 300 to a read only memory ROM 302, arandom access memory RAM 303 and a wireless interface 305.

The memory 303 contains registers intended to receive variables and theinstructions of the program related to the algorithms as disclosed inFIGS. 13, 14, 15 and 16.

The processor 300 controls the operation of the wireless interface 305.

The read only memory 302 contains instructions of the program related tothe algorithms as disclosed in FIGS. 13, 14, 15 and 16, which aretransferred, when the mobile station MS is powered on, to the randomaccess memory 303.

The wireless interface 305 comprises means for mapping data onsub-carriers comprised in the clusters of sub-carriers allocated to themobile station MS.

The wireless interface 305 comprises an encoder as disclosed in FIG. 4.The wireless interface 305 may comprise a decoder as disclosed in FIG.5.

FIG. 4 illustrates the architecture of the encoder according to aparticular embodiment of the invention in frequency domain.

Data to be transmitted are coded and organized as symbols by the codingand modulation module 40 giving a set of symbols x_(n). Then the signalis spread in the frequency domain by the DFT (Discrete FourierTransform) module 41. In a variant, the DFT module is replaced by a FastFourier Transform module or any other processing module.

In case of OFDMA, DFT module may not be needed.

The symbols spread in the frequency domain are mapped on sub-carrierscomprised in the allocated frequency band by a frequency mapping module42 which maps data to be transferred on sub-carriers. The frequencymapping module 42 comprises zero insertion and/or frequency shapingcapabilities.

The frequency mapping module 42 maps symbols on the frequency bandallocated to the mobile station MS. As the sub-carriers are notallocated in a contiguous sub-band, the frequency band is separated intoseveral clusters. The frequency mapping module 42 maps symbols on thedifferent clusters of the frequency band allocated to the mobile stationMS.

In FIG. 4, the frequency mapping module 42 shows an example whereinT=T₀+T₁+T₂ symbols are mapped on T sub-carriers of three clusters of atleast one group of resource blocks. A first cluster comprises thesub-carriers noted n₀ to n₀+T₀−1, a second cluster comprises thesub-carriers noted n₁ to n₁+T₁−1 and a third cluster comprises thesub-carriers noted n₂ to n₂+T₂−1.

The symbols outputted by the frequency mapping module 42 are transformedback in the time domain by the IDFT (Inverse Discrete Fourier Transform)module 43.

An optional cyclic prefix insertion module 44 can be applied beforetransmission through the antenna of the mobile station MS.

FIG. 5 illustrates the architecture of the decoder of a device accordingto a particular embodiment of the invention.

At least one signal 57 is received from at least one receive antenna.The synchronization module 50 synchronizes the received signal 57.

The optional cyclic prefix removal module 51 removes the cyclic prefixif used, to the synchronized signal.

The DFT module 52 executes a DFT on the synchronized signal on which thecyclic prefix has been removed or not. In a variant, the DFT module isreplaced by a Fast Fourier Transform module or any other processingmodule.

A channel estimation module 54 will work on the signals provided by theDFT module 52. The output of the channel estimation module 54 commandsan equalization module 53. The output of the equalization module 53 isprocessed by an inverse DFT module 55 before a classical channeldecoding module 56 which treats the resulting signal.

In case of OFDMA, IDFT module 55 may not be needed. In other variants,it may be replaced with other processing modules.

The demodulating and decoding module 56 demodulates and decodes thesymbols into data.

FIG. 6 represents a first example of three clusters of at least onegroup of resource blocks allocated to a mobile station and parametersaccording to the present invention.

In the example of FIG. 6, three non contiguous clusters of one or pluralcontiguous groups of resource blocks are allocated to one mobile stationMS.

FIG. 6 discloses fourteen groups of resource blocks. The first group ofresource blocks which is hachured in FIG. 6, is a dummy one. OnlyN_(RBG) equals thirteen groups of resource blocks, numbered here fromone to thirteen, physically exist. Other conventions of smaller orlarger numbering may exist.

The groups of resource blocks are ordered and have an index varying from1 to 13. The groups of resource blocks are the ones of the set ofresources of the wireless cellular telecommunication network which maybe allocated to the mobile station MS.

The present invention intends to define information which enable areceiver like a mobile station MS to identify which groups of resourceblocks are allocated to the mobile station, for example for uplinktransmission.

In the example of FIG. 6, six parameters noted M₀ to M₅ are needed torepresent resource allocation configuration of the mobile station MS.

The parameter M₀ represents the number plus one of physically existinggroups of resource blocks which are not allocated to the mobile stationMS and which have an index lower than the index of the first group ofresource blocks of the first cluster of one or plural contiguous groupsof resource blocks allocated to the mobile station MS. In the example ofFIG. 6, M₀ is equal to one as there is a dummy group of resource blocks.The dummy group of resource blocks is virtual and considered as notallocated to the mobile station MS. Then, the first group of resourceblocks which physically exists and having the lowest index within theset of groups of resource blocks is the first group of resource blocksof the first cluster of one or plural contiguous groups of resourceblocks allocated to the mobile station MS. The subset of at least onegroup of resource blocks which is associated to the parameter M₀comprises the dummy group of resource blocks.

The parameter M₁ represents the number of groups of resource blockswhich are allocated to the mobile station MS and which belong to thefirst cluster of one or plural contiguous groups of resource blocksallocated to the mobile station MS. In the example of FIG. 6, M₁ isequal to two. The subset of at least one group of resource blocks whichis associated to the parameter M₁ comprises the groups of resourceblocks having the indexes 1 and 2.

The parameter M₂ represents the number of groups of resource blocks notallocated to the mobile station MS which are between the first clusterof one or plural contiguous groups of resource blocks allocated to themobile station MS and the second cluster of one or plural contiguousgroups of resource blocks allocated to the mobile station MS. In theexample of FIG. 6, M₂ is equal to three. The subset of at least onegroup of resource blocks which is associated to the parameter M₂comprises the groups of resource blocks having the indexes 3, 4 and 5.

The parameter M₃ represents the number of groups of resource blockswhich are allocated to the mobile station MS and which belong to thesecond cluster of one or plural contiguous groups of resource blocksallocated to the mobile station MS. In the example of FIG. 6, M₃ isequal to four. The subset of at least one group of resource blocks whichis associated to the parameter M₃ comprises the groups of resourceblocks having the indexes 6, 7, 8 and 9.

The parameter M₄ represents the number of groups of resource blocks notallocated to the mobile station MS which are between the second clusterof one or plural contiguous groups of resource blocks allocated to themobile station MS and the third cluster of one or plural contiguousgroups of resource blocks allocated to the mobile station MS. In theexample of FIG. 6, M₄ is equal to one. The subset of at least one groupof resource blocks which is associated to the parameter M₄ comprises thegroup of resource blocks having the index 10.

The parameter M₅ represents the number of groups of resource blockswhich are allocated to the mobile station MS and which belong to thethird cluster of one or plural contiguous groups of resource blocksallocated to the mobile station MS. In the example of FIG. 6, M₅ isequal to one. The subset of at least one group of resource blocks whichis associated to the parameter M₅ comprises the group of resource blockshaving the index 11.

FIG. 7 discloses a first example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a first mode of realisation of the presentinvention.

In the first mode of realisation, the number n of clusters of at leastone group of resource blocks is known by the mobile station MS.

According to the first example, clusters of at least one group ofresource blocks can take any size with any spacing, Q=2n and q_(k)=1 forany k=0 . . . 2n−1.

M₀ . . . . M_(2n-1) parameters represent the n different sizes ofallocated clusters of least one group of resource blocks and the ndifferent gaps between clusters of at least one group of resourceblocks. They can be ordered according to any predetermined common ruleshared by the base station BS and the mobile stations MS.

The weighted sum constraint becomes:

${\sum\limits_{k = 0}^{{2n} - 1}\; M_{k}} \leq {N_{RBG} + 1.}$

There can be at most n_(max)=(N_(RBG)+1)/2 clusters of at least onegroup of resource blocks.

The parameter M₀ can take values from 1 to N_(RBG)−2n+2. With a fixedM₀, there are C(N_(RBG)+1−M₀,2n−1) possible allocations where C(x,y) isequal to C_(x) ^(y) which is the number of possible combinations of xelements among y elements.

For any fixed parameter M₀, the parameter M₁ can take values from 1 toN_(RBG)−M₀−2n+3.

With a fixed couple of parameters (M₀,M₁), there areC(N_(RBG)+1−M₀−M₁,2n−2) possible allocations.

For any fixed (M₀,M₁), parameter M₂ can take values from 1 toN_(RBG)−M₀−M₁−2n+4. With a fixed (M₀, M₁, M₂), there areC(N_(RBG)+1−M₀−M₁−M₂,2n−3) possible allocations.

For any fixed (M₀, . . . M_(k−1)), parameter M_(k) can take values from1 to N_(RBG)−

${\sum\limits_{p = 0}^{k - 1}\; M_{p}} - {2n} + k + 2.$

With a fixed (M₀, M₁, . . . , M_(k)), there are

$C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 0}^{k}\; M_{p}}},{{2n} - k - 1}} \right)$

possible allocations.

For example, the present algorithm will be described when it is executedby the processor 200 of the base station BS.

It has to be noted here that in a variant, instead of being executed bythe base station BS, the present algorithm is executed by a core networkdevice not shown in FIG. 1 of the wireless cellular telecommunicationdevice for plural base stations BS.

The present algorithm is executed each time clusters of sub-carriers areallocated to a mobile station MS handled by the base station BS.

At step S700, the processor 200 allocates groups of resource blocks tothe mobile station MS. The allocated groups of resource blocks areallocated for example according to channel conditions and/or accordingto required quality of service. The allocated groups of resource blocksare divided into n clusters of one or plural contiguous groups ofresource blocks.

For example, the allocated groups of resource blocks are the onesdisclosed in FIG. 6.

At next step S701, the processor 200 determines 2n parameters from theallocated groups of resource blocks.

M₀ is equal to one, M₁ is equal to two, M₂ is equal to three, M₃ isequal to four, M₄ is equal to one and M₅ is equal to one.

At next step S702, the processor 200 calculates a sum S₀(M₀) accordingto the following formula:

${{S_{0}\left( M_{0} \right)} = {{\sum\limits_{m_{0} = 1}^{M_{0} - 1}\; {{{C\left( {{N_{RBG} + 1 - m_{0}},{{2n} - 1}} \right)}.{If}}\mspace{14mu} M_{0}}} = 1}},{{S_{0}\left( M_{0} \right)} = 0.}$

According to the example of FIG. 6, S₀(M₀)=0.

The sum S₀(M₀) is the number of possibilities of having in the subsetcorresponding to M₀, an amount of groups of resource blocks m₀ that islower than the first parameter M₀.

At next step S703, the processor 200 sets the value of the informationRIV_(n) enabling the mobile station MS to identify which resources ofthe wireless telecommunication network are allocated to the mobilestation MS to the value S₀(M₀).

At next step S704, the processor 200 sets the value of the variable k toone.

At next step S705, the processor 200 calculates a sum S_(k)(M₀, . . . ,M_(k)) according to the following formula:

${S_{k}\left( {M_{0},\ldots \mspace{14mu},M_{k}} \right)} = {\sum\limits_{m_{k} = 1}^{M_{k} - 1}\; {C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 0}^{k - 1}\; M_{p}} - m_{k}},{{2n} - 1 - k}} \right)}}$(and  S_(k)(M₀, …  , M_(k)) = 0

The sum S_(k)(M₀, . . . , M_(k)) is the total number of possibleresource allocations with the k subsets of groups of resource blockscomprising respectively an amount of groups of resource blocks ofexactly M₀, . . . M_(k−1), and with a (k+1)-th subset of groups ofresource blocks comprising an amount of resources m_(k) inferior to thevalue of the parameter M_(k).

For example, for k=1 and respectively 2, the following sums arecomputed:

${S_{1}\left( {M_{0},M_{1}} \right)} = {\sum\limits_{m_{1} = 1}^{M_{1} - 1}\; {C\left( {{N_{RBG} + 1 - M_{0} - m_{1}},{{2n} - 2}} \right)}}$and  if${M_{1} = 1},{{S_{1}\left( {M_{0},M_{1}} \right)} = 0},{{S_{2}\left( {M_{0},M_{1},M_{2}} \right)} = {\sum\limits_{m_{2} = 1}^{M_{2} - 1}\; {C\left( {{N_{RBG} + 1 - M_{0} - M_{1} - m_{2}},{{2n} - 3}} \right)}}}$and  if M₂ = 1, S₂(M₀, M₁, M₂) = 0.

In other words, for each value of k, with k=1 . . . 2n−1, the processor200 calculates, within the set of possible resource allocations, thenumber of possibilities of having for each subset corresponding to aparameter M₀ to M_(k−1) having a lower rank than the parameter M_(k) anamount of groups of resources blocks that is equal to the parameter M₀to M_(k−1) the subset corresponds to and having in the subsetcorresponding to the parameter M_(k) an amount of groups of resourcesblocks that is lower than the parameter M_(k).

At next step S706, the processor 200 sets the value of the informationRIV_(n) enabling the mobile station MS to identify which resources ofthe wireless telecommunication network are allocated to the mobilestation MS to the value RIV_(n)+S_(k)(M₀, . . . , M_(k)).

At next step S707, the processor 200 checks if k is equal to 2n−1. If kis equal to 2n−1, the processor 200 moves to step S709. Otherwise, theprocessor 200 moves to step S708, increments the variable k by one andreturns to step S705.

At step S709, the processor 200 commands the transfer of the informationRIV_(n) enabling the mobile station MS to identify which resources ofthe wireless telecommunication network are allocated to the mobilestation MS.

According to the example of FIG. 6:

S0(M0)=0,

S₁(M₀,M₁)=495,

S₂(M₀,M₁,M₂)=204,

S₃(M₀,M₁,M₂,M₃)=46,

S₄(M₀,M₁,M₂,M₃,M₄)=0,

and S₅(M₀,M₁,M₂,M₃,M₄,M₅)=0.

RIV_(n) is equal to 745.

FIG. 8 discloses a second example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a second mode of realisation of thepresent invention.

In the second mode of realisation, the number n of clusters of at leastone group of resource blocks may vary from n_(min) to n_(max), n_(min)being known by the mobile station MS. n_(min) is different from n_(max)and n_(min) is upper than one. n_(max) is equal to (N_(RBG)+1)/2).

For example, the present algorithm will be described when it is executedby the processor 200 of the base station BS.

It has to be noted here that in a variant, instead of being executed bythe base station BS, the present algorithm is executed by a core networkdevice not shown in FIG. 1 of the wireless cellular telecommunicationdevice for plural base stations BS.

The present algorithm is executed each time clusters of sub-carriers areallocated to a mobile station MS handled by the base station BS.

At step S800, the processor 200 allocates groups of resource blocks tothe mobile station MS. The allocated groups of resource blocks areallocated for example according to channel conditions and/or accordingto required quality of service. The allocated groups of resource blocksare divided into n clusters of at least one group of resource blocks.

For example, the allocated groups of resource blocks are the onesdisclosed in FIG. 6.

At next step S801, the processor 200 determines 2n parameters from theallocated groups of resource blocks.

M₀ is equal to one, M₁ is equal to two, M₂ is equal to three, M₃ isequal to four, M₄ is equal to one and M₅ is equal to one, n_(min) isequal to two, n_(max) is equal to seven and n is equal to three.

At next step S802, the processor 200 calculates the number of allpossible resource allocations containing n′ clusters out of N_(RBG)groups of resource blocks, wherein n′ varies from n_(min) to n minus 1:

$\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}\; {{C\left( {{N_{RBG} + 1},{2n^{\prime}}} \right)}.}$

At next step S803 the processor 200 calculates a sum S₀(M₀) according tothe following formula:

${{S_{0}\left( M_{0} \right)} = {{\sum\limits_{m_{0} = 1}^{M_{0} - 1}\; {{{C\left( {{N_{RBG} + 1 - m_{0}},{{2n} - 1}} \right)}.{If}}\mspace{14mu} M_{0}}} = 1}},{{S_{0}\left( M_{0} \right)} = 0.}$

According to the example of FIG. 6, S₀(M₀)=0.

The sum S₀(M₀) is the number of possibilities of having in subsetcorresponding to M₀, an amount of groups of resource blocks m₀ that islower than the first parameter M₀.

At next step S804, the processor 200 sets the value of the informationRIV_(n) enabling the mobile station MS to identify which resources ofthe wireless telecommunication network are allocated to the mobilestation MS to the value S₀(M₀).

At next step S805, the processor 200 sets the variable k to one value.

At next step S806, the processor 200 calculates a sum S_(k)(M₀, . . . ,M_(k)) according to the following formula:

${S_{k}\left( {M_{0},\ldots \mspace{14mu},M_{k}} \right)} = {\sum\limits_{m_{k} = 1}^{M_{k} - 1}{C\left( {{N_{RGB} + 1 - {\sum\limits_{p = 0}^{k - 1}M_{p}} - m_{k}},{{2n} - 1 - k}} \right)}}$(and  S_(k)(M₀, …  , M_(k )) = 0  if  M_(k) = 1).

The sum S_(k)(M₀, . . . , M_(k)) is the total number of possibleresource allocations with the k subsets of groups of resource blockscomprising respectively an amount of groups of resource blocks ofexactly M₀, . . . M_(k−1), and with a (k+1)-th subset of groups ofresource blocks comprising an amount of resources m_(k) inferior to thevalue of the parameter M_(k).

In other words, for each value of k, with k=1 . . . 2n−1, the processor200 calculates, within the set of possible groups of resource blocksallocations, the number of possibilities of having for each subsetcorresponding to a parameter M₀ to M_(k−1) having a lower rank than theparameter M_(k) an amount of groups of resource blocks that is equal tothe corresponding parameter M₀ to M_(k−1) and having in the subsetcorresponding to the parameter M_(k) an amount of groups of resourceblocks that is lower than the parameter M_(k).

At next step S807, the processor 200 sets the value of the informationRIV′ enabling the mobile station MS to identify which resources of thewireless telecommunication network are allocated to the mobile stationMS to the value RIV′+S_(k)(M₀, . . . , M_(k)).

At next step S808, the processor 200 checks if k is equal to 2n−1. If kis equal to 2n−1, the processor 200 moves to step S810. Otherwise, theprocessor 200 moves to step S809, increments the variable k by one andreturns to step S806.

At step S810, the processor 200 calculates the information RIV′ enablingthe mobile station MS to identify which resources of the wirelesstelecommunication network are allocated to the mobile station MSaccording to the following formula:

${{RIV}^{\prime}M_{0}\mspace{14mu} \ldots \mspace{14mu} M_{{2n} - 1}} = {{\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{C\left( {{N_{RGB} + 1},{2n^{\prime}}} \right)}} + {{RIV}^{\prime}M_{0}\mspace{11mu} \ldots \mspace{14mu} M_{{2n} - 1}}}$

At next step S811, the processor 200 commands the transfer of theinformation RIV′ enabling the mobile station MS to identify whichresources of the wireless telecommunication network are allocated to themobile station MS

According to the above mentioned example:

C(N_(RBG)+1, 2n′)=1001

S₀(M₀)=0,

S₁(M₀,M₁)=495,

S₂(M₀,M₁,M₂)=204,

S₃(M₀,M₁,M₂,M₃)=46,

S₄(M₀,M₁,M₂,M₃,M₄)=0,

and S₅(M₀,M₁,M₂,M₃,M₄,M₅)=0.

RIV′ is equal to 1746.

FIG. 9 discloses a third example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a third mode of realisation of the presentinvention.

In the third mode of realisation, the allocated clusters have the samenumber of groups of resource blocks. The number n of clusters of atleast one group of resource blocks is known by both the base station BSand mobile station MS.

For an allocation of n clusters having the same number of groups ofresource blocks, Q=n+1 independent parameters are needed, under aweighted sum constraint

${\sum\limits_{k = 0}^{Q - 1}{q_{k}M_{k}}} \leq {N_{RBG} + 1.}$

The Q parameters represent the n gaps between clusters and the group ofgroups of resource blocks which are not allocated to the mobile stationand which has or have an index lower than the index of the first groupof resource blocks allocated to the mobile station MS, plus the numberof groups of resource blocks comprised in each cluster.

These parameters may appear in any order. The coefficient qcorresponding to the parameter representative of number of groups ofresource blocks comprised in each cluster is equal to n. All the otherscoefficients are equal to one.

Let M_(r) be the parameter corresponding to the number of groups ofresource blocks comprised in each cluster and let us suppose in a firstinstance that r>0. The weighted sum constraint becomes:

${{n\; M_{r}} + {\sum\limits_{\underset{k \neq r}{k = 0}}^{n}M_{k}}} \leq {N_{RBG} + 1.}$

For all k<r, for any fixed parameter (M₀ . . . M_(k−1)), the parameterM_(k) takes values from 1 to

$\left. M_{k,\max} \right|_{k < r} = {N_{RBG} + 2 - {2n} + k - {\sum\limits_{p = 0}^{k - 1}M_{p}}}$

where |_(k<r) denotes the condition k<r. For any fixed (M₀ . . . M_(k)),there are:

$\sum\limits_{M_{r} = 1}^{{floor}{\lbrack{{({N_{RGB} + 2 - {\sum\limits_{p = 0}^{k}M_{p}} - n + k})}/n}\rbrack}}{C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 0}^{k}M_{p}} - {n\; M_{r}}},{n - k - 1}} \right)}$

possibilities of allocation where floor(x) is the integer part of x.

For any fixed (M₀ . . . M_(r-1)), M_(r) takes values from 1 to

$M_{r,\max} = {{{floor}\left\lbrack {\left( {N_{RGB} + 1 - {\sum\limits_{p = 0}^{r - 1}M_{p}} - n + r} \right)/n} \right\rbrack}.}$

For any fixed (M₀ . . . M_(r)), there are

$C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 0}^{r - 1}M_{p}} - {n\; M_{r}}},{n - r}} \right)$

possible resource allocations.

For all k>r, for any fixed (M₀ . . . M_(k−1)), the parameter M_(k) talesvalues from 1 to

$\left. M_{k,\max} \right|_{k > r} = {N_{RBG} + 1 - n + k - {\sum\limits_{\underset{p \neq r}{p = 0}}^{k - 1}M_{p}} - {n\; {M_{r}.}}}$

For any fixed (M₀ . . . M_(k)), there are

$C\left( {{N_{RBG} + 1 - {\sum\limits_{\underset{p \neq k}{p = 0}}^{k}M_{p}} - {n\; M_{r}}},{n - k}} \right)$

possible combinations.

Then, for all k=0 . . . n, the number of groups with m_(p)=M_(p), forp<k, m_(k)<M_(k), and any choice of m_(k+1 . . . n),

${{{{S_{k,{eqclusters}}\left( {M_{0},{\ldots \mspace{14mu} M_{k}}} \right)} = {\sum\limits_{m_{k} = 1}^{M_{k} - 1}\sum\limits_{M_{r} = 1}^{{floor}{\lbrack{{({N_{RGB} + 2 - {\sum\limits_{p = 0}^{k - 1}M_{p}} - m_{k} - n + k})}/n}\rbrack}}}}\quad}{C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 0}^{k - 1}M_{p}} - m_{k} - {n\; M_{r}}},{n - k - 1}} \right)}},\text{}\mspace{20mu} {{{if}\mspace{14mu} k} < r}$$\mspace{20mu} {{\sum\limits_{m_{k} = 1}^{M_{k} - 1}{C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 0}^{r - 1}M_{p}} - {n\; m_{r}}},{n - r}} \right)}},\mspace{20mu} {{{if}\mspace{14mu} k} = r}}$$\mspace{20mu} {{\sum\limits_{m_{k} = 1}^{M_{k} - 1}{C\left( {{N_{RBG} + 1 - {\sum\limits_{\underset{p \neq k}{p = 0}}^{k - 1}M_{p}} - m_{k} - {n\; M_{r}}},{n - k}} \right)}},\mspace{20mu} {{{if}\mspace{14mu} k} > {r.}}}$

The information RIV″ enabling the mobile station MS to identify whichresources of the wireless telecommunication network are allocated to themobile station MS is equal to:

${{RIV}^{''}\left( {M_{0},M_{1},\ldots \mspace{14mu},M_{n}} \right)} = {\sum\limits_{k = 0}^{n}{{S_{k,{eqclusters}}\left( {M_{0},\ldots \mspace{14mu},M_{k}} \right)}.}}$

The inventors of the present invention have found that by selectingM_(o) as being the number of groups of resource blocks comprised in eachof the clusters, the above mentioned formulas can be simplified.

The weighted sum constraint becomes:

${{n\; M_{0}} + {\sum\limits_{k = 1}^{n}M_{k}}} \leq {N_{RBG} + 1}$

M₀ takes values from 1 to floor((N_(RBG)+1−n)/n). For any fixed M₀ thereare C(N_(RBG)+1−nM₀,n) possible combinations.

For any k>0, for any fixed (M₀ . . . M_(k−1)) parameters, the parameterM_(k) takes values from 1 to

$M_{k,\max} = {N_{RBG} + 1 - n + k - {n\; M_{0}} - {\sum\limits_{p = 1}^{k - 1}{M_{p}.}}}$

For any fixed (M₀ . . . M_(k)) parameters, there are

$C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 1}^{k}M_{p}} - {n\; M_{0}}},{n - k}} \right)$

possible allocations.

Overall, there are

${{RIV}_{n,\max}^{''} = {{\sum\limits_{M_{0} = 1}^{{{floor}\mspace{14mu} {NRBG}} + 1 - {n/n}}{CN}_{RBG}} + 1 - {nM}_{0}}},n$

possible allocations with n equal clusters.

For example, the present algorithm will be described when it is executedby the processor 200 of the base station BS.

It has to be noted here that in a variant, instead of being executed bythe base station BS, the present algorithm is executed by a core networkdevice not shown in FIG. 1 of the wireless cellular telecommunicationdevice for plural base stations BS.

The present algorithm is executed each time clusters of sub-carriers areallocated to a mobile station MS handled by the base station BS.

At step S900, the processor 200 allocates groups of resource blocks tothe mobile station MS. The allocated groups of resource blocks areallocated for example according to channel conditions and/or accordingto required quality of service.

At next step S901, the processor 200 determines the parameters from theallocated groups of resource blocks and sets M₀ to the number of groupsof resource blocks which are allocated to the mobile station MS in eachcluster of one or plural contiguous groups of resource blocks.

For example, the allocated groups of resource blocks and the determinedparameters are as disclosed in FIG. 10.

FIG. 10 represents a second example of three clusters of at least onegroup of resource blocks allocated to a mobile station and parametersaccording to the present invention.

In the example of FIG. 10, three clusters of at least one group ofresource blocks are allocated to one mobile station MS and are notcontiguous. Each allocated cluster comprises the same number of groupsof resource blocks.

FIG. 10 discloses fourteen groups of resource blocks. The first group ofresource blocks which is hachured in FIG. 10, is a dummy one. Theordered groups of resource blocks having an index varying from 1 to 13are the one of the wireless cellular telecommunication network which maybe allocated to the mobile station MS. Four parameters noted M_(o) to M₃are needed to represent the groups of resource blocks which areallocated to the mobile station MS.

The parameter M₀ represents the number of groups of resource blockswhich are allocated to the mobile station MS in each cluster of one orplural contiguous groups of resource blocks. In the example of FIG. 10,M₀ is equal to two. The subset of at least one group of resource blockswhich comprises the groups of resource blocks having the indexes 2 and 3is associated to the parameter M₀.

The subset of at least one group of resource blocks which comprises thegroups of resource blocks having the indexes 7 and 8 is associated tothe parameter M₀.

The subset of at least one group of resource blocks which comprises thegroups of resource blocks having the indexes 11 and 12 is associated tothe parameter M₀.

The parameter M₁ represents the number plus one of physically existinggroups of resource blocks which are not allocated to the mobile stationMS and which have an index inferior to the index of the first group ofresource blocks of the first cluster of one or plural contiguous groupsof resource blocks allocated to the mobile station MS. In the example ofFIG. 10, M₁ is equal to two. The subset of at least one group ofresource blocks which comprises the dummy group of resource blocks andthe group of resource blocks having the index 1 is associated to theparameter M₁.

The parameter M₂ represents the number of groups of resource blockswhich are between the first cluster of one or plural contiguous groupsof resource blocks allocated to the mobile station MS and the secondcluster of one or plural contiguous groups of resource blocks allocatedto the mobile station MS. In the example of FIG. 10, M₂ is equal tothree. The subset of at least one group of resource blocks whichcomprises the groups of resource blocks having the indexes 4, 5 and 6 isassociated to the parameter M₂.

The parameter M₃ represents the number of groups of resource blockswhich are between the second cluster of one or plural contiguous groupsof resource blocks allocated to the mobile station MS and the thirdcluster of one or plural contiguous groups of resource blocks allocatedto the mobile station MS. In the example of FIG. 10, M₃ is equal to two.The subset of at least one group of resource blocks which comprises thegroups of resource blocks having the indexes 9 and 10 is associated tothe parameter M₃.

At next step S902, the processor 200 calculates a sum S″₀(M₀) accordingto the following formula:

${{S_{0}^{''}\left( M_{0} \right)} = {{\sum\limits_{m_{0} = 1}^{M_{0} - 1}{{{C\left( {{N_{RBG} + 1 - {n\; m_{0}}},n} \right)}.\mspace{14mu} {If}}\mspace{14mu} M_{0}}} = 1}},{S_{0} = 0.}$

According to the example of FIG. 10, S₀“(M₀)=165.

The sum S₀”(M₀) is the number of possible resource allocations withm₀<M₀. Here, this is the number of possible resource allocationconfigurations with equal clusters containing less than M₀ resourceblock groups each.

At next step S903, the processor 200 sets the value of the informationRIV″ enabling the mobile station MS to identify which resources of thewireless telecommunication network are allocated to the mobile stationMS to the value S₀″(M₀).

At next step S904, the processor 200 sets the value of the variable k toone.

At next step S905, the processor 200 calculates a sum S_(k)″(M₀, . . . ,M_(k)) according to the following formula:

${S_{k}^{''}\left( {M_{0}\mspace{14mu} \ldots \mspace{14mu} M_{k}} \right)} = {\sum\limits_{m_{k} = 1}^{M_{k} - 1}{C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 1}^{k - 1}M_{p}} - {nM}_{0} - m_{k}},{n - k}} \right)}}$and${S_{k}^{``}\left( {M_{0},\ldots \mspace{14mu},M_{k}} \right)} = {{0\mspace{14mu} {if}\mspace{14mu} M_{k}} = 1.}$

The sum S_(k)(M₀, . . . , M_(k)) is the total number of possibleresource allocations with the k subsets of groups of resource blockscomprising respectively an amount of groups of resource blocks ofexactly M₀, . . . M_(k−1), and with a (k+1)-th subset of groups ofresource blocks comprising an amount of resources m_(k) inferior to thevalue of the parameter M_(k).

In other words, for each value of k, with k=1 . . . n, the processor 200calculates, within the set of possible groups of resource blocksallocations, the number of possibilities of having for each subsetcorresponding to a parameter M₀ to M_(k−1) having a lower rank than theparameter M_(k) an amount of groups of resource blocks that is equal tothe corresponding parameter M₀ to M_(k−1) and having in the subsetcorresponding to the parameter M_(k) an amount of groups of resourceblocks that is lower than the parameter M_(k).

At next step S906, the processor 200 sets the value of the informationRIV″ enabling the mobile station MS to identify which resources of thewireless telecommunication network are allocated to the mobile stationMS to the value RIV″+S_(k)″(M₀, . . . , M_(k)).

At next step S907, the processor 200 checks if k is equal to n. If k isequal to n, the processor 200 moves to step S909. Otherwise, theprocessor 200 moves to step S908, increments the variable k by one andreturns to step S905.

At next step S909, the processor 200 commands the transfer of theinformation RIV″ enabling the mobile station MS to identify whichresources of the wireless telecommunication network are allocated to themobile station MS

According to the above mentioned example:

S₀″(M₀)=165,

S₁−(M₀,M₁)=21,

S₂″(M₀,M₁,M₂)=9,

and S₃″(M₀,M₁,M₂,M₃)=1.

RIV″ is equal to 196.

It has to be noted here that in a variant, the number of clusters may bedecided by the base station BS and is not known by the mobile stationMS.

In such case, instead of setting at step S903 the value of theinformation RIV″ enabling the mobile station MS to identify whichresources of the wireless telecommunication network are allocated to themobile station MS to the value S₀″(M₀), the processor 200 sets the valueof the information RIV″ enabling the mobile station MS to identify whichresources of the wireless telecommunication network are allocated to themobile station MS to the value

${S_{0}^{‘’}\left( M_{0} \right)} + {\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{{RIV}_{n^{\prime},\max}^{''}\mspace{14mu} {where}}}$${{RIV}_{n^{\prime},\max}^{''} = {{\sum\limits_{M_{0} = 1}^{{{floor}\mspace{14mu} {NRBG}} + 1 - {n^{\prime}/n^{\prime}}}{CN}_{RBG}} + 1 - {n^{\prime}M_{0}}}},{n^{\prime}.}$

FIG. 11 discloses a fourth example of an algorithm executed by a basestation in order to indicate the groups of resource blocks allocated toa mobile station according to a fourth mode of realization of thepresent invention.

In the fourth mode of realization, the allocated clusters are spaced bythe same number of groups of resource blocks. The number n of clustersof at least one group of resource blocks is known by both the basestation BS and the mobile station MS.

Here, Q=n+2 parameters are necessary. One parameter for theinter-clusters gaps, one parameter is for the number plus one ofphysically existing groups of resource blocks not allocated to themobile station MS having an index value lower than the first group ofresource blocks allocated to the mobile station MS and n parameters forthe n cluster sizes.

To simplify the formulas, the common inter cluster gap value is thefirst parameter, the second parameter is the number plus one ofphysically existing groups of resource blocks not allocated to themobile station MS and having an index value lower than the first groupof resource blocks allocated to the mobile station MS and nextparameters are the n values of cluster sizes.

The formulas are similar to the third mode of realization with someslight modifications: Q=n+2, q0=n−1, q_(k)=1 for any k=1 . . . n+1.

The weighted sum constraint becomes:

${{\left( {n - 1} \right)M_{0}} + {\sum\limits_{k = 1}^{n + 1}M_{k}}} \leq {N_{RBG} + 1}$

M₀ takes values from 1 to floor((N_(RBG)−n)/(n−1)). For any fixed M₀there are C(N_(RBG)+1−(n−1)M₀,n+1) possible combinations.

For any k>0, for any fixed (M₀ . . . M_(k−1)), parameter M_(k) talesvalues from 1 to

$\begin{matrix}{M_{k,\max} = {N_{RBG} + 1 - {\left( {n - 1} \right)M_{0}} - {\sum\limits_{p = 1}^{k - 1}M_{p}} - \left( {n + 1 - k} \right)}} \\{= {N_{RBG} - n + k - {\left( {n - 1} \right)M_{0}} - {\sum\limits_{p = 1}^{k - 1}{M_{p}.}}}}\end{matrix}$

For any fixed (M₀ . . . M_(k)), there are

$C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 1}^{k}M_{p}} - {\left( {n - 1} \right)M_{0}}},{n - k + 1}} \right)$

possible allocations.

Overall, there are

${{RIV}_{nmax}^{\prime\prime\prime} = {{\sum\limits_{M_{0} = 1}^{{{floor}\mspace{14mu} N_{RBG}} - {n/{({n - 1})}}}{CN}_{RBG}} + 1 - {\left( {n - 1} \right)M_{0}}}},{n + 1}$

possible resource allocation configurations with n clusters of any sizebut equally spaced.

For example, the present algorithm will be described when it is executedby the processor 200 of the base station BS.

It has to be noted here that in a variant, instead of being executed bythe base station BS, the present algorithm is executed by a core networkdevice not shown in FIG. 1 of the wireless cellular telecommunicationdevice for plural base stations BS.

The present algorithm is executed each time clusters of sub-carriers areallocated to a mobile station MS handled by the base station BS.

At step S1100, the processor 200 allocates groups of resource blocks tothe mobile station MS. The allocated groups of resource blocks areallocated for example according to channel conditions and/or accordingto required quality of service.

At next step S1101, the processor 200 determines the parameters from theallocated groups of resource blocks and sets M₀ to the number of groupsof resource blocks which separate two clusters of groups of resourceblocks which are allocated to the mobile station MS.

For example, the allocated groups of resource blocks and the determinedparameters are as disclosed in FIG. 12.

FIG. 12 represents a third example of three clusters of at least onegroup of resource blocks allocated to a mobile station and parametersaccording to the present invention.

In the example of FIG. 12, three clusters of at least one group ofresource blocks are allocated to one mobile station MS and are notcontiguous. Each cluster is separated from another cluster by the samenumber of groups of resource blocks.

FIG. 12 discloses fourteen groups of resource blocks. The first group ofresource blocks which is hachured in FIG. 12, is a dummy one. The groupsof resource blocks are ordered and have an index varying from 1 to 13.The groups of resource blocks are the one of the wireless cellulartelecommunication network which may be allocated to the mobile stationMS.

Five parameters noted M₀ to M₄ are needed to represent the groups ofresource blocks which are allocated to the mobile station MS.

The parameter M₀ represents the number of groups of resource blockswhich separate two clusters of at least one group of resource blockswhich are allocated to the mobile station MS. In the example of FIG. 12,M₀ is equal to two.

The subset of at least one group of resource blocks which comprises thegroups of resource blocks having the indexes 2 and 3 is associated tothe parameter M₀.

The subset of at least one group of resource blocks which comprises thegroups of resource blocks having the indexes 7 and 8 is associated tothe parameter M₀.

The parameter M₁ represents the number of physically existing groups ofresource blocks plus one which are not allocated to the mobile stationMS and which have an index inferior to the index of the first group ofresource blocks of the first cluster of one or plural contiguous groupsof resource blocks allocated to the mobile station MS. In the example ofFIG. 12, M₁ is equal to one. The subset of at least one group ofresource blocks which comprises the dummy group of resource blocks isassociated to the parameter M₁.

The parameter M₂ represents the number of groups of resource blockswhich are comprised in the first cluster of one or plural contiguousgroups of resource blocks allocated to the mobile station MS. In theexample of FIG. 12, M₂ is equal to one. The subset of at least one groupof resource blocks which comprises the group of resource blocks havingthe index 1 is associated to the parameter M₂.

The parameter M₃ represents the number of groups of resource blockswhich are comprised in the second cluster of one or plural contiguousgroups of resource blocks allocated to the mobile station MS. In theexample of FIG. 12, M₃ is equal to three. The subset of at least onegroup of resource blocks which comprises the groups of resource blockshaving the indexes 4, 5 and 6 is associated to the parameter M₃.

The parameter M₄ represents the number of groups of resource blockswhich are comprised in the third cluster of one or plural contiguousgroups of resource blocks allocated to the mobile station MS. In theexample of FIG. 12, M₄ is equal to two. The subset of at least one groupof resource blocks which comprises the groups of resource blocks havingthe indexes 9 and 10 is associated to the parameter M₄.

At next step S1102, the processor 200 calculates a sum S₀(M₀) accordingto the following formula:

${{S_{0}^{\prime\prime\prime}\left( M_{0} \right)} = {{\sum\limits_{m_{0} = 1}^{M_{0} - 1}{{{C\left( {{N_{RBG} + 1 - {\left( {n - 1} \right)m_{0}}},{n + 1}} \right)}.\mspace{14mu} {If}}\mspace{14mu} M_{0}}} = 1}},{S_{0} = 0.}$

According to the example of FIG. 10, S₀′″(M₀)=165.

The sum S₀′″(M₀) is the number of possible resource allocations withm₀<M₀. Here, this is the number of possible resource allocations withclusters of any size spaced by equal inter-clusters gaps containing thesame number of groups of resource blocks which is less than M₀.

At next step S1103, the processor 200 sets the value of the informationRIV′″ enabling the mobile station MS to identify which resources of thewireless telecommunication network are allocated to the mobile stationMS to the value S₀′″(M₀).

At next step S1104, the processor 200 sets the value of the variable kto one.

At next step S1105, the processor 200 calculates a sum S_(k)′″(M₀, . . ., M_(k)) according to the following formula:

${S_{k}^{\prime\prime\prime}\left( {M_{0}\mspace{14mu} \ldots \mspace{14mu} M_{k}} \right)} = {\sum\limits_{m_{k} = 1}^{M_{k} - 1}{C\left( {{N_{RBG} + 1 - {\sum\limits_{p = 1}^{k - 1}M_{p}} - {\left( {n - 1} \right)M_{0}} - m_{k}},{n - k + 1}} \right)}}$     and   S_(k)^(’’’)(M₀, …  , M_(k)) = 0  if  M_(k) = 1.

The sum S_(k)(M₀, . . . , M_(k)) is the total number of possibleresource allocations with the k subsets of groups of resource blockscomprising respectively an amount of groups of resource blocks ofexactly M₀, . . . M_(k−1), and with a (k+1)-th subset of groups ofresource blocks comprising an amount of resources m_(k) inferior to thevalue of the parameter M_(k).

In other words, for each value of k, with k=1 . . . n+1, the processor200 calculates, within the set of possible groups of resource blocksallocations, the number of possibilities of having for each subsetcorresponding to a parameter M₀ to M_(k−1) having a lower rank than theparameter M_(k) an amount of groups of resource blocks that is equal tothe corresponding parameter M₀ to M_(k−1) and having in the subsetcorresponding to the parameter M_(k) an amount of groups of resourceblocks that is lower than the parameter M_(k).

At next step S1106, the processor 200 sets the value of the informationRIV′″ enabling the mobile station MS to identify which resources of thewireless telecommunication network are allocated to the mobile stationMS to the value RIV′″+S_(k)′″(M₀, . . . , M_(k)).

At next step S1106, the processor 200 checks if k is equal to n+1. If kis equal to n+1, the processor 200 moves to step S1109. Otherwise, theprocessor 200 moves to step S1108, increments the variable k by one andreturns to step S1105.

At next step S1109, the processor 200 commands the transfer of theinformation RIV′″ enabling the mobile station MS to identify whichresources of the wireless telecommunication network are allocated to themobile station MS.

According to the above mentioned example:

S₀′″(M₀)=495,

S₁′″(M₀,M₁)=0,

S₂′″(M₀,M₁,M₂)=0,

S₃′″(M₀,M₁,M₂,M₃)=13

and S₄′″(M₀,M₁,M₂,M₃,M₄)=1.

RIV′″ is equal to 509.

It has to be noted here that in a variant, the number of clusters may bedecided by the base station BS and is not known by the mobile stationMS.

In such case, instead of setting at step S903 the value of theinformation RIV′″ enabling the mobile station MS to identify whichresources of the wireless telecommunication network are allocated to themobile station MS to the value S₀′″(M₀), the processor 200 sets thevalue of the information RIV′″ enabling the mobile station MS toidentify which resources of the wireless telecommunication network areallocated to the mobile station MS to the value

${S_{0}^{{’’}’}\left( M_{0} \right)} + {\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{{RIV}_{n^{\prime},\max}^{\prime\prime\prime}\mspace{14mu} {where}}}$${{RIV}_{n^{\prime}\max}^{\prime\prime\prime} = {{\sum\limits_{M_{0} = 1}^{{{floor}\mspace{14mu} N_{RBG}} - {n^{\prime}/{({n^{\prime} - 1})}}}{CN}_{RBG}} + 1 - {\left( {n^{\prime} - 1} \right)M_{0}}}},{n^{\prime} + 1}$

FIG. 13 discloses a first example of an algorithm executed by a mobilestation according to the first mode of realization of the presentinvention.

In the first mode of realization, the number n of clusters of at leastone group of resource blocks is known by the mobile station MS.

More precisely, the present algorithm is executed by the processor 300of each mobile station MS.

At step S1300, the processor 300 detects the reception through thewireless interface 305 of information RIV_(n) enabling the determinationof which groups of resource blocks are allocated to the mobile stationMS.

At next step S1301, the processor 300 finds M′₀ such thatS₀(M₀′)≦RIV_(n)<S₀(M₀′+1) using the same formula as the one disclosed atstep S702 of FIG. 7.

According to the example of FIG. 6, S₀(1)=0≦745<S₀(2)=C(13,5)=1287.

The processor 300 finds M′₀=1.

At next step S1302, the processor 300 decides that M₀=M′_(o)=1.

In other words, the processor 300:

-   -   determines a number of possibilities of having a subset of at        least one group of resource blocks corresponding to the        parameter M₀, the subset comprising less than a first amount of        resources M′₀,    -   determines a number of possibilities of having a subset of at        least one resource corresponding to the parameter M₀, the subset        comprising less than the amount M′₀ plus one of groups of        resource blocks,    -   selects the first amount of groups of resource blocks as a first        parameter if the number of possibilities of having a subset of        at least one group of resource blocks corresponding to the first        parameter, the subset comprising less than the first amount of        groups of resource blocks, is lower than or equal to the        received information and if the number of possibilities of        having a subset corresponding to the first parameter, the subset        of at least one group of resource blocks comprising less than        the first amount of groups of resource blocks plus one, is upper        than the received information.

At next step S1303, the processor 300 sets the information RIV_(n)enabling the determination of which groups of resource blocks areallocated to the mobile station MS to the value of RIV_(n) minus S₀(M₀),i.e. to the value 745.

At next step S1304, the processor 300 sets the value of the variable kto one.

At next step S1305, the processor 300 finds M′_(k) such that

S_(k)(M₀, . . . , M_(k−1),M_(k)′)≦RIV_(n)<S_(k)(M₀, . . . ,M_(k−1),M_(k)′+1) using the same formula as the one disclosed at stepS705 of FIG. 7.

In other words, the processor 300:

-   -   determines for the parameter M_(k), within the set of possible        groups of resource blocks allocations:    -   a first number of possibilities of having for each subset of at        least one group of resource blocks corresponding to a parameter        M₀ to M_(k−1) having a lower rank than the parameter M_(k), each        subset comprising an amount of groups of resource blocks that is        equal to the parameter M₀ to M_(k−1) the subset corresponds to        and having a subset of at least one group of resource blocks        corresponding to the parameter M_(k) comprising an amount of        groups of resource blocks that is lower than a given value,    -   a second number of possibilities of having for each subset of at        least one group of resource blocks corresponding to a parameter        M₀ to M_(k−1) having a lower rank than the parameter M_(k), each        subset comprising an amount of groups of resource blocks that is        equal to the parameter M₀ to M_(k−1) the subset corresponds to        and having a subset of at least one group of resource blocks        corresponding to the parameter M_(k) comprising an amount of        groups of resource blocks that is lower than the given value        plus one,    -   selects the given value as the parameter M_(k) if the first        number is lower than or equal to the modified information and if        the second number is upper than the modified information,    -   updates the modified information by subtracting the first number        from the modified information.

At next step S1306, the processor 300 sets the information RIV_(n)enabling the determination of which groups of resource blocks areallocated to the mobile station MS to the value of RIV_(n) minusS_(k)(M₀, . . . , M_(k))

At next step S1307, the processor 300 checks if k is equal to 2n−1. If kis equal to 2n−1, the processor 200 interrupts the present algorithm aseach parameter has been identified. Otherwise, the processor 300 movesto step S1309, increments the variable k by one and returns to stepsS1305.

According to the example of FIG. 6:

S₁(1,2)=495≦745<S₁(1,3)=825, the processor 300 determines M₁ as beingequal to two,

RIV_(n) becomes equal to 250,

S₂(1,2,3)=204≦745−495<S₂(1,2,4)=260, the processor 300 determines M₂ asbeing equal to three,

RIV_(n) becomes equal to 46,

S₃(1,2,3,4)=46=RIV_(n)<S₃(1,2,3,5)=52, the processor 300 determines M₃as being equal to four,

RIV_(n) becomes equal to null value,

As RIV_(n) becomes equal to null value, the processor 300 determines M₄and M₅ as being equal to one. All parameters being determined, theprocessor 300 interrupts the present algorithm.

FIG. 14 discloses a second example of an algorithm executed by a mobilestation according to the second mode of realization of the presentinvention.

In the second mode of realization, the number n of clusters of at leastone group of resource blocks may vary from n_(min) to n_(max), n_(min)being known by the mobile station MS. n_(min) is different from n_(max)and n_(min) is upper than one. n_(max) is equal to or lower than(N_(RBG)+1)/2).

More precisely, the present algorithm is executed by the processor 300of each mobile station MS.

At step S1400, the processor 300 detects the reception through thewireless interface 305 of information RIV′ enabling the determination ofwhich groups of resource blocks are allocated to the mobile station MS.

At next step S1401, the processor 300 finds n such that:

${\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{C\left( {{N_{RBG} + 1},{2\; n^{\prime}}} \right)}} \leq {RIV}^{\prime} < {\sum\limits_{n^{\prime} = n_{\min}}^{n}{{C\left( {{N_{RBG} + 1},{2\; n^{\prime}}} \right)}.}}$

According to the example of FIG. 6,C(14,4)=1001≦RIV′<C(14,4)+C(14,6)=4004.

The processor 300 determines that n is equal to three.

At next step S1403, the processor 300 sets the information RIV′ enablingthe determination of which groups of resource blocks are allocated tothe mobile station MS to the value of RIV′ minus

${\sum\limits_{n^{\prime} = n_{\min}}^{n}{C\left( {{N_{RBG} + 1},{2\; n^{\prime}}} \right)}},$

i.e. to the value 745.

At next step S1404, the processor 300 finds M′₀ such thatS₀(M₀′)≦RIV_(n)<S₀(M₀′+1) using the same formulas as the one disclosedat steps S702 and S703 of FIG. 7.

According to the example of FIG. 6, S₀(1)=0≦745<S₀(2)=C(13,5)=1287.

The processor 300 finds M′₀=1.

At next step S1405, the processor 300 decides that M₀=M′₀=1.

In other words, the processor 300:

-   -   determines a number of possibilities of having a subset of at        least one group of resource blocks corresponding to the        parameter M₀, the subset comprising less than a first amount of        resources M′₀,    -   determines a number of possibilities of having a subset of at        least one resource corresponding to the parameter M₀, the subset        comprising less than the amount M′₀ plus one of groups of        resource blocks,    -   selects the first amount of groups of resource blocks as a first        parameter if the number of possibilities of having a subset of        at least one group of resource blocks corresponding to the first        parameter, the subset comprising less than the first amount of        groups of resource blocks, is lower than or equal to the        received information and if the number of possibilities of        having a subset corresponding to the first parameter, the subset        of at least one group of resource blocks comprising less than        the first amount of groups of resource blocks plus one, is upper        than the received information.

At next step S1406, the processor 300 sets the information RIV′ enablingthe determination of which groups of resource blocks are allocated tothe mobile station MS to the value of RIV′ minus S₀(M₀), i.e. to thevalue 745.

At next step S1407, the processor 300 sets the variable k to the valueone.

At next step S1408, the processor 300 finds M′_(k) such that:

S_(k)(M₀, . . . , M_(k−1),M_(k)′)≦RIV′<S_(k)(M₀, . . . ,M_(k−1),M_(k)′+1) using the same formula as the one disclosed at stepS806 of FIG. 8.

At next step S1409, the processor 300 decides that M_(k)=M′_(k).

In other words, the processor 300:

-   -   determines for the parameter M_(k), within the set of possible        groups of resource blocks allocations:    -   a first number of possibilities of having for each subset of at        least one group of resource blocks corresponding to a parameter        M₀ to M_(k−1) having a lower rank than the parameter M_(k), each        subset comprising an amount of groups of resource blocks that is        equal to the parameter M₀ to M_(k−1) the subset corresponds to        and having a subset of at least one group of resource blocks        corresponding to the parameter M_(k) comprising an amount of        groups of resource blocks that is lower than a given value,    -   a second number of possibilities of having for each subset of at        least one group of resource blocks corresponding to a parameter        M₀ to M_(k−1) having a lower rank than the parameter M_(k), each        subset comprising an amount of groups of resource blocks that is        equal to the parameter M₀ to M_(k−1) the subset corresponds to        and having a subset of at least one group of resource blocks        corresponding to the parameter M_(k) comprising an amount of        groups of resource blocks that is lower than the given value        plus one,    -   selects the given value as the parameter M_(k) if the first        number is lower than or equal to the modified information and if        the second number is upper than the modified information,    -   updates the modified information by subtracting the first number        from the modified information.

At next step S1410, the processor 300 sets the information RIV′ enablingthe determination of which groups of resource blocks are allocated tothe mobile station MS to the value of RIV′ minus S_(k)(M₀, . . . ,M_(k))

At next step S1411, the processor 300 checks if k is equal to 2n−1. If kis equal to 2n−1, the processor 200 interrupts the present algorithm aseach parameter has been identified. Otherwise, the processor 300 movesto step S1412, increments the variable k by one and returns to stepsS1408.

According to the example of FIG. 6:

S₁(1,2)=495≦745<S₁(1,3)=825, the processor 300 determines M₁ as beingequal to two,

RIV′ becomes equal to 250,

S₂(1,2,3)=204≦745−495<S₂(1,2,4)=260, the processor 300 determines M₂ asbeing equal to three,

RIV′ becomes equal to 46,

S₃(1,2,3,4)=46=RIV_(n)<S₃(1,2,3,5)=52, the processor 300 determines M₃as being equal to four,

RIV′ becomes equal to null value,

As RIV′ becomes equal to null value, the processor 300 determines M₄ andM₅ as being equal to one.

Since all the parameters have been determined, the processor 300identifies among the set of resources that can be allocated in thewireless telecommunication network to the mobile station, whichresources of the wireless telecommunication network are allocated to themobile station according to the determined parameters.

FIG. 15 discloses a third example of an algorithm executed by a mobilestation according to the third mode of realization of the presentinvention.

In the third mode of realization, the allocated clusters have the samenumber of groups of resource blocks.

More precisely, the present algorithm is executed by the processor 300of each mobile station MS.

At step S1500, the processor 300 detects the reception through thewireless interface 305 of information RIV″ enabling the determination ofwhich groups of resource blocks are allocated to the mobile station MS.

At next step S1501, the processor 300 finds M′₀ such thatS″₀(M₀′)≦RIV_(n)″<S″₀(M₀+1) using the same formula as the one disclosedat step S902 of FIG. 9.

According to the example of FIG. 10, S″₀(2)=165≦196<S″₀(3)=285.

The processor 300 finds M′₀=2.

At next step S1502, the processor 300 decides that M₀=M′₀=2.

At next step S1503, the processor 300 sets the information RIV″ enablingthe determination of which groups of resource blocks are allocated tothe mobile station MS to the value of RIV″ minus S″₀(M₀), i.e. to thevalue 31.

At next step S1504, the processor 300 sets the variable k to the valueone.

At next step S1505, the processor 300 finds M′_(k) such that

S″_(k)(M₀, . . . , M_(k−1), M_(k)′)≦RIV_(n)″<S″_(k)(M₀, . . . , M_(k−1),M_(k)′+1) using the same formula as the one disclosed at step S905 ofFIG. 9.

At next step S1506, the processor 300 decides that M_(k)=M′_(k).

At next step S1507, the processor 300 sets the information RIV″ enablingthe determination of which groups of resource blocks are allocated tothe mobile station MS to the value of RIV″ minus S″_(k)(M₀, . . . ,M_(k)).

At next step S1508, the processor 300 checks if k is equal to n. If k isequal to n, the processor 200 interrupts the present algorithm as eachparameter has been identified. Otherwise, the processor 300 moves tostep S1509, increments the variable k by one and returns to steps S1305.

According to the example of FIG. 10:

S″₁(2,2)=21≦31<S″₁(2,3)=36, the processor 300 determines M₁ as beingequal to two,

RIV″ becomes equal to 10,

S″₂(2,2,3)=9≦10<S″₂(2,2,4)=12, the processor 300 determines M₂ as beingequal to three,

RIV″ becomes equal to 1,

S″₃(2,2,3,2)=1=RIV″, the processor 300 determines M₃ as being equal totwo,

RIV″ becomes equal to null value.

Since all the parameters have been determined, the processor 300identifies among the set of resources that can be allocated in thewireless telecommunication network to the mobile station, whichresources of the wireless telecommunication network are allocated to themobile station according to the determined parameters.

It has to be noted here that in a variant, the number of clusters may bedecided by the base station BS and is not known by the mobile stationMS.

In such case, the processor 300 executes similar steps as the stepsS1401 and S1403 of FIG. 14 prior to executing the step S1501 using thefollowing formulas:

-   -   find n such that:

${{{\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{RIV}_{n^{\prime},\max}^{''}} \leq {RIV}^{''} < {{\sum\limits_{n^{\prime} = n_{\min}}^{n}{RIV}_{n^{\prime},\max}^{''}} - {RIV}^{''}}} = {{RIV}^{''} - {\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{RIV}_{n^{\prime},\max}^{''}}}},\mspace{20mu} {where}$$\mspace{20mu} {{{RIV}_{n^{\prime},\max}^{''} = {{\sum\limits_{M_{0} = 1}^{{{floor}\mspace{14mu} {NRBG}} + 1 - {n^{\prime}/n^{\prime}}}{CN}_{RBG}} + 1 - {n^{\prime}M_{0}}}},{n^{\prime}.}}$

FIG. 16 discloses a fourth example of an algorithm executed by a mobilestation according to the fourth mode of realization of the presentinvention.

In the fourth mode of realization, the allocated clusters are spaced bythe same number of groups of resource blocks.

More precisely, the present algorithm is executed by the processor 300of each mobile station MS.

At step S1600, the processor 300 detects the reception through thewireless interface 305 of information RIV′″ enabling the determinationof which groups of resource blocks are allocated to the mobile stationMS.

At next step S1601, the processor 300 finds M′₀ such thatS′″₀(M₀)≦RIV′″<S′″₀(M₀′+1) using the same formula as the one disclosedat step S1102 of FIG. 11.

According to the example of FIG. 12, S′″₀(2)=495≦509<S′″₀(3)=825.

The processor 300 finds M′₀=2.

At next step S1602, the processor 300 decides that M₀=M′₀=2.

At next step S1603, the processor 300 sets the information RIV′″enabling the determination of which groups of resource blocks areallocated to the mobile station MS to the value of RIVn′″ minusS′″₀(M₀), i.e. to the value 14.

At next step S1604, the processor 300 sets the variable k to the valueone.

At next step S1605, the processor 300 finds M′_(k) such that

S′″_(k)(M₀, . . . , M_(k−1), M_(k)′)≦RIV′″<S′″_(k)(M₀, . . . , M_(k−1),M_(k)′++1) using the same formula as the one disclosed at step S1105 ofFIG. 11.

At next step S1606, the processor 300 decides that M_(k)=M'_(k).

At next step S1607, the processor 300 sets the information RIV′″enabling the determination of which groups of resource blocks areallocated to the mobile station MS to the value of RIVn′″ minusS′″_(k)(M₀, . . . , M_(k))

At next step S1608, the processor 300 checks if k is equal to n+1. If kis equal to n+1, the processor 200 interrupts the present algorithm aseach parameter has been identified. Otherwise, the processor 300 movesto step S1609, increments the variable k by one and returns to stepsS1605.

According to the example of FIG. 12:

S′″₁(2,1)=0≦14<S₁(2,2)=84, the processor 300 determines M₁ as beingequal to one,

RIV′″ becomes equal to 14,

S′″₂(2,1,1)=0≦14<S′″₂(2,1,2)=28, the processor 300 determines M₂ asbeing equal to one,

RIV′″ becomes equal to 14,

S′″₃(2,1,1,3)=13≦14<S′″₃(2,1,1,4)=18, RIV′″, the processor 300determines M₃ as being equal to three,

RIV′″ becomes equal to one.

S′″₄(2,1,1,3,2)=RIV′″, the processor 300 determines M₄ as being equal totwo.

Since all the parameters have been determined, the processor 300identifies among the set of resources that can be allocated in thewireless telecommunication network to the mobile station, whichresources of the wireless telecommunication network are allocated to themobile station according to the determined parameters.

It has to be noted here that in a variant, the number of clusters may bedecided by the base station BS and is not known by the mobile stationMS.

In such case, the processor 300 executes similar steps as the stepsS1401 and S1403 of FIG. 14 prior to executing the step S1601 using thefollowing formulas:

-   -   find n such that:

${{{\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{RIV}_{n^{\prime},\max}^{\prime\prime\prime}} \leq {RIV}^{\prime\prime\prime} < {{\sum\limits_{n^{\prime} = n_{\min}}^{n}{RIV}_{n^{\prime},\max}^{\prime\prime\prime}} - {RIV}^{\prime\prime\prime}}} = {{RIV}^{\prime\prime\prime} - {\sum\limits_{n^{\prime} = n_{\min}}^{n - 1}{RIV}_{n^{\prime},\max}^{\prime\prime\prime}}}},\mspace{20mu} {where}$$\mspace{20mu} {{{RIV}_{n^{\prime},\max}^{\prime\prime\prime} = {{\sum\limits_{M_{0} = 1}^{{{floor}\mspace{14mu} N_{RBG}} - {n^{\prime}/{({n^{\prime} - 1})}}}{CN}_{RBG}} + 1 - {\left( {n^{\prime} - 1} \right)M_{0}}}},{n^{\prime} + 1.}}$

Naturally, many modifications can be made to the embodiments of theinvention described above without departing from the scope of thepresent invention.

1. Method for determining information which enable a mobile station toidentify among a set of resources that can be allocated in a wirelesstelecommunication network to the mobile station, which resources of thewireless telecommunication network are allocated to the mobile station,the allocated resources being divided into plural non contiguousclusters of one resource or of plural contiguous resources,characterised in that the method comprises: allocating resources to themobile station, the allocated resources dividing the set of resourcesinto subsets of resources; determining, from the allocated resources,plural ordered parameters, each parameter being equal to a number ofcontiguous resources in a subset of at least one resource correspondingto the parameter, the at least one resource being not allocated to themobile station or forming a cluster of one resource or of pluralcontiguous resources allocated to the mobile station; calculating, forthe first parameter, within the set of possible resource allocations,the number of possibilities of having in the corresponding subset, anamount of resources that is lower than the first parameter; calculating,for each following parameter, within the set of possible resourceallocations, the number of possibilities of having for each subsetcorresponding to a parameter having a lower rank than said followingparameter an amount of resources that is equal to the parameter having alower rank the subset corresponds to and the number of possibilities ofhaving in the subset corresponding to said following parameter an amountof resources that is lower than said following parameter; determininginformation which enable a mobile station to identify which resources ofthe wireless telecommunication network are allocated to the mobilestation by summing all the calculated numbers, the information dependingon the number of resources that can be allocated in a wirelesstelecommunication network to the mobile station and of the number ofclusters.
 2. Method according to claim 1, wherein at least twononcontiguous clusters of one resource or of plural contiguous resourcesare allocated to the mobile station, each cluster of one resource or ofplural contiguous resources comprising a number of resources which isindependent of the number of resources comprised in other allocatedcluster or clusters of one resource or of plural contiguous resources,and the number of resources separating two clusters of one resource orof plural contiguous resources is independent of any other resourcesthat may either separate two clusters of one resource or of pluralcontiguous resources, or be comprised in other allocated clusters of oneresource or of plural contiguous resources.
 3. Method according to claim1, wherein at least three noncontiguous clusters of one resource or ofplural contiguous resources are allocated to the mobile station, eachcluster of one resource or of plural contiguous resources comprising thesame number of resources which is independent of any other resourcesthat may separate two clusters.
 4. Method according to claim 3, whereinthe first parameter is the number of resources comprised in each clusterof one resource or of plural contiguous resources.
 5. Method accordingto claim 1, wherein at least three noncontiguous clusters of oneresource or of plural contiguous resources are allocated to the mobilestation, each cluster of one resource or of plural contiguous resourcescomprising a number of resources which is independent of the number ofresources comprised in other allocated clusters of one resource or ofplural contiguous resources and the numbers of resources separating twoclusters are identical.
 6. Method according to claim 5, wherein thefirst parameter is the number of resources separating two clusters ofone resource or of plural contiguous resources.
 7. Method according toclaim 1, wherein the number of clusters of one resource or of pluralcontiguous resource is predetermined.
 8. Method according to claim 1,wherein the method comprises further steps of: computing the number ofall possible resource allocations with at least a predetermined numberof clusters and less than the current number of clusters; modifying theinformation which enables the mobile station to identify which resourcesof the wireless telecommunication network are allocated to the mobilestation by adding the number of all possible resource allocations withat least a predetermined number of clusters and less than the currentnumber of clusters to the information.
 9. Method for identifying among aset of resources that can be allocated in a wireless telecommunicationnetwork to a mobile station, which resources of the wirelesstelecommunication network are allocated to the mobile station, theallocated resources being divided into plural non contiguous clusters ofone resource or of plural contiguous resources, wherein the methodcomprises executed by the mobile station: receiving information whichenable the mobile station to identify which resources of the wirelesstelecommunication network are allocated to the mobile station, theinformation depending on the number of resources that can be allocatedin a wireless telecommunication network to the mobile station and of thenumber of clusters; determining a number of possibilities of having asubset of at least one resource corresponding to a first parameter, thesubset comprising an amount of resources that is lower than a firstamount of resources; determining a number of possibilities of having asubset of at least one resource corresponding to the first parameter,the subset comprising less than the first amount of resources plus one;selecting the first amount of resources as a first parameter if thenumber of possibilities of having a subset of at least one resourcecorresponding to the first parameter, the subset comprising less thanthe first amount of resources, is lower than or equal to the receivedinformation and if the number of possibilities of having a subsetcorresponding to the first parameter, the subset of at least oneresource comprising less than the first amount of resources plus one, isupper than the received information; modifying the information whichenables the mobile station to identify which resources of the wirelesstelecommunication network are allocated to the mobile station bysubtracting the number of possibilities of having a subset of at leastone resource corresponding to the first parameter, the subset comprisingan amount of resources inferior to the first parameter, from theinformation which enables the mobile station to identify which resourcesof the wireless telecommunication network are allocated to the mobilestation; and as far as all the parameters are not determined,determining for the following parameter, within the set of possibleresource allocations: a first number of possibilities of having for eachsubset of at least one resource corresponding to a parameter having alower rank than said following parameter, each subset comprising anamount of resources that is equal to the parameter the subsetcorresponds to and having a subset of at least one resourcecorresponding to said following parameter comprising an amount ofresources that is lower than a given value; a second number ofpossibilities of having for each subset of at least one resourcecorresponding to a parameter having a lower rank than said followingparameter, each subset comprising an amount of resources that is equalto the parameter the subset corresponds to and having a subset of atleast one resource corresponding to said following parameter comprisingan amount of resources that is lower than a given value plus one;selecting the given value as following parameter if the first number islower than or equal to the modified information and if the second numberis upper than the modified information; updating the modifiedinformation by subtracting the first number from the modifiedinformation; identifying among the set of resources that can beallocated in the wireless telecommunication network to the mobilestation, which resources of the wireless telecommunication network areallocated to the mobile station according to the parameters when all theparameters are determined.
 10. Method according to claim 9, wherein thenumber of allocated clusters is determined by the mobile station by:determining the number of resource allocations with at least a minimumpredetermined number of clusters and less than a given number ofclusters; determining the number of resource allocations with at leastthe minimum predetermined number of clusters and less than the givennumber plus one of clusters; selecting the given number as the number ofclusters if the number of resource allocations with at least thepredetermined minimum number of clusters and less than the given numberof clusters is lower than or equal to the received information and ifthe number of resource allocations with at least the minimumpredetermined number of clusters and less than the given number plus oneof clusters is upper than the received information; modifying thereceived information by subtracting the value of number of resourceallocations with at least the predetermined minimum number of clustersand less than the given number of clusters from the receivedinformation.
 11. Device for determining information which enable amobile station to identify among a set of resources that can beallocated in a wireless telecommunication network to the mobile station,which resources of the wireless telecommunication network are allocatedto the mobile station, the allocated resources being divided into pluralnon contiguous clusters of one resource or of plural contiguousresources, characterised in that the device for determining informationcomprises: means for allocating resources to the mobile station, theallocated resources dividing the set of resources into subsets ofresources; means for determining, from the allocated resources, pluralordered parameters, each parameter being equal to a number of contiguousresources in a subset of at least one resource corresponding to theparameter, the at least one resource being not allocated to the mobilestation or forming a cluster of one resource or of plural contiguousresources allocated to the mobile station; means for calculating, forthe first parameter, within the set of possible resource allocations,the number of possibilities of having in the corresponding subset, anamount of resources that is lower than the first parameter; means forcalculating, for each following parameter, within the set of possibleresource allocations, the number of possibilities of having for eachsubset corresponding to a parameter having a lower rank than saidfollowing parameter an amount of resources that is equal to theparameter the subset corresponds to and having in the subsetcorresponding to said following parameter an amount of resources that islower than said following parameter; means for determining informationwhich enable a mobile station to identify which resources of thewireless telecommunication network are allocated to the mobile stationby summing all the calculated numbers, the information depending on thenumber of resources that can be allocated in a wirelesstelecommunication network to the mobile station and of the number ofclusters.
 12. Device for identifying among a set of resources that canbe allocated in a wireless telecommunication network to a mobilestation, which resources of the wireless telecommunication network areallocated to the mobile station, the allocated resources being dividedinto plural non contiguous clusters of one resource or of pluralcontiguous resources, characterised in that the device for identifyingis included in the mobile station and comprises: means for receivinginformation which enable the mobile station to identify which resourcesof the wireless telecommunication network are allocated to the mobilestation, the information depending on the number of resources that canbe allocated in a wireless telecommunication network to the mobilestation and of the number of clusters; means for determining a number ofpossibilities of having a subset of at least one resource correspondingto a first parameter, the subset comprising less than a first amount ofresources; means for determining a number of possibilities of having asubset of at least one resource corresponding to the first parameter,the subset comprising less than the first amount of resources plus one;means for selecting the first amount of resources as a first parameterif the number of possibilities of having a subset of at least oneresource corresponding to the first parameter, the subset comprisingless than the first amount of resources, is lower than or equal to thereceived information and if the number of possibilities of having asubset corresponding to the first parameter, the subset of at least oneresource comprising less than the first amount of resources plus one, isupper than the received information; means for modifying the informationwhich enables the mobile station to identify which resources of thewireless telecommunication network are allocated to the mobile stationby subtracting the number of possibilities of having a subset of atleast one resource corresponding to the first parameter, thecorresponding subset comprising an amount of resources inferior to thefirst parameter from the information which enables the mobile station toidentify which resources of the wireless telecommunication network areallocated to the mobile station; means for determining for the followingparameter, within the set of possible resource allocations and as far asall the parameters are not determined: a first number of possibilitiesof having for each subset of at least one resource corresponding to aparameter having a lower rank than said following parameter, each subsetcomprising an amount of resources that is equal to the parameter thesubset corresponds to and having a subset of at least one resourcecorresponding to said following parameter comprising an amount ofresources that is lower than a given value; a second number ofpossibilities of having for each subset of at least one resourcecorresponding to a parameter having a lower rank than said followingparameter, each subset comprising an amount of resources that is equalto the parameter the subset corresponds to and having a subset of atleast one resource corresponding to said following parameter comprisingan amount of resources that is lower than a given value plus one; meansfor selecting for said following parameter the given value as followingparameter if the first number is lower than or equal to the modifiedinformation and if the second number is upper than the modifiedinformation, as far as all the parameters are not determined; means forupdating the modified information by subtracting the first number fromthe modified information as far as all the parameters are notdetermined; means for identifying among the set of resources that can beallocated in the wireless telecommunication network to the mobilestation, which resources of the wireless telecommunication network areallocated to the mobile station according to the parameters when all theparameters are determined.
 13. Computer program which can be directlyloadable into a programmable device, comprising instructions or portionsof code for implementing the steps of the method according to claim 1,when said computer program is executed on a programmable device. 14.Computer program which can be directly loadable into a programmabledevice, comprising instructions or portions of code for implementing thesteps of the method according to claim 9, when said computer program isexecuted on a programmable device.